Collaborative coverage using a swarm of networked miniature robots
نویسندگان
چکیده
We study distributed coverage of environments with unknown extension using a team of networked miniature robots analytically and experimentally. Algorithms are analyzed by incrementally raising the abstraction level starting from physical robots, to realistic and discrete-event system (DES) simulation. The realistic simulation is calibrated using sensor and actuator noise characteristics of the real platform and serves for calibration of the DES microscopic model. The proposed algorithm is robust to positional noise and communication loss, and its performance gracefully degrades for communication and localization failures to a lower bound, which is given by the performance of a non-coordinated, randomized solution. Results are validated by real robot experiments with miniature robots with a size smaller than 2cm x 2cm x 3cm in a boundary coverage case study. Trade-offs between the abilities of the individual platform, required communication, and algorithmic performance are discussed.
منابع مشابه
Comparing Coordination Schemes for Miniature Robotic Swarms: A Case Study in Boundary Coverage of Regular Structures
We consider boundary coverage of a regular structure by a swarm of miniature robots, and compare a suite of three fully distributed coordination algorithms experimentally. All algorithms rely on boundary coverage by reactive control, whereas coordination of the robots high-level behavior is fundamentally different: random, self-organized, and deliberative with reactive elements. The self-organi...
متن کاملCoordination SChemeS for diStributed boundary Coverage with a Swarm of miniature robotS: SyntheSiS, analySiS and experimental validation
We provide a comparison of a series of original coordination mechanisms for the distributed boundary coverage problem with a swarm of miniature robots. Our analysis is based on real robot experimentation and models at different levels of abstraction. Distributed boundary coverage is an instance of the distributed coverage problem and has applications such as inspection of structures, de-mining,...
متن کاملDistributed Boundary Coverage with a Team of Networked Miniature Robots using a Robust Market-Based Algorithm Citation
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation problem and has applications in inspection, cleaning, and painting among others. The proposed algorithm is robust to sensor and actuator noise, failure of individual robots, and communication loss. We use a market-based al...
متن کاملRecovery in Autonomous Robot Swarms
A swarm of robots is composed of several small and simple robots that can communicate to perform complex tasks. Those robots are subject to failures: battery outage, hardware destruction, or hardware failure. When a robot fails, its whole state is lost. The task realized by this robot needs to be restarted then the swarm might need some data from the failed robot. Even when this data is not nee...
متن کاملDistributed Coverage Control with Sensory Feedback for Networked Robots
This paper presents a control strategy that allows a group of mobile robots to position themselves to optimize the measurement of sensory information in the environment. The robots use sensed information to estimate a function indicating the relative importance of different areas in the environment. Their estimate is then used to drive the network to a desirable placement configuration using a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Robotics and Autonomous Systems
دوره 57 شماره
صفحات -
تاریخ انتشار 2009